Scale-free networks from optimal design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Growing optimal scale-free networks via likelihood.

Preferential attachment, by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree, has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree k is proportional to k^{-γ}. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal ...

متن کامل

Super-star networks: Growing optimal scale-free networks via likelihood

Preferential attachment — where new nodes are added and attached to existing nodes with probability proportional to the existing nodes’ degree — has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree k is proportional to k−γ . However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that...

متن کامل

Reliability of Optimal Linear Projection of Growing Scale-Free Networks

Singular Value Decomposition (SVD) is a technique based on linear projection theory, which has been frequently used for data analysis. It constitutes an optimal (in the sense of least squares) decomposition of a matrix in the most relevant directions of the data variance. Usually, this information is used to reduce the dimensionality of the data set in a few principal projection directions, thi...

متن کامل

Exactly scale-free scale-free networks

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...

متن کامل

From scale-free to Erdos-Rényi networks.

We analyze a model that interpolates between scale-free and Erdos-Rényi networks. The model introduced generates a one-parameter family of networks and allows one to analyze the role of structural heterogeneity. Analytical calculations are compared with extensive numerical simulations in order to describe the transition between these two important classes of networks. Finally, an application of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Europhysics Letters (EPL)

سال: 2002

ISSN: 0295-5075,1286-4854

DOI: 10.1209/epl/i2002-00248-2